Geometric Query Types for Data Retrieval in Relational Databases
نویسندگان
چکیده
This paper describes the application of geometric concepts for data retrieval and proposes a geometric model for accessing and manipulating multidimensional data in relational databases. A geometric query model is proposed for the queries based on locations of geometric objects. In the geometric query model, the data from the database are interpreted geometrically as multidimensional geometric points or geometric objects interpolated on these points, and the query window is a query solid of any shape specified by its location. The spatial queries are formulated with geometric objects and operations over them. Descriptions of geometric objects and operations with implicit functions are proposed. This mathematical representation allowed us to develop a compact and easily extensible geometric query model that has been implemented in the geometric query system prototype.
منابع مشابه
Relational Databases Query Optimization using Hybrid Evolutionary Algorithm
Optimizing the database queries is one of hard research problems. Exhaustive search techniques like dynamic programming is suitable for queries with a few relations, but by increasing the number of relations in query, much use of memory and processing is needed, and the use of these methods is not suitable, so we have to use random and evolutionary methods. The use of evolutionary methods, beca...
متن کاملGeo-Relational Algebra: A Model and Query Language for Geometric Database Systems
The user's conceptual model of a database system for geometric data should be simple and precise: easy to learn and understand, with clearly defined semantics, expressive: allow to express with ease all desired query and data manipulation tasks, efficiently implementable. To achieve these goals we propose to extend relational database management systems by integrating geometry at all levels: At...
متن کاملBridging Information Retrieval and Databases
For bridging the gap between information retrieval (IR) and databases (DB), this article focuses on the logical view. We claim that IR should adopt three major concepts from DB, namely inference, vague predicates and expressive query languages. By regarding IR as uncertain inference, probabilistic versions of relational algebra and Datalog yield very powerful inference mechanisms for IR as well...
متن کاملApply Uncertainty in Document-Oriented Database (MongoDB) Using F-XML
As moving to big data world where data is increasing in unstructured way with high velocity, there is a need of data-store to store this bundle amount of data. Traditionally, relational databases are used which are now not compatible to handle this large amount of data, so it is needed to move on to non-relational data-stores. In the current study, we have proposed an extension of the Mongo...
متن کاملStorage and Retrieval of XML Documents Using Object-Relational Databases
This paper describes general storage and retrieval methods for XML documents using object-relational databases. The storage method decomposes tree structure of XML documents into nodes, and stores them in relational tables according to the node types. By using this method, being independent of DTDs or element types, any XML documents can be stored in databases. Also it is possible to utilize in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Data Knowl. Eng.
دوره 27 شماره
صفحات -
تاریخ انتشار 1998